-
1 Hartley transform
-
2 fast Hartley transform
Техника: быстрое преобразование ХартлиУниверсальный англо-русский словарь > fast Hartley transform
-
3 discrete Hartley transform
дискретное преобразование Хартли, ДПХEnglish-Russian electronics dictionary > discrete Hartley transform
-
4 fast Hartley transform
быстрое преобразование Хартли, БПХEnglish-Russian electronics dictionary > fast Hartley transform
-
5 two-dimensional Hartley transform
English-Russian electronics dictionary > two-dimensional Hartley transform
-
6 transform
1) преобразование; отображение || преобразовывать(ся); отображать(ся)2) результат преобразования; образ; отображение3) трансформация; превращение; переход || трансформировать(ся); превращать(ся); переходить•- chirp-Z transform
- code transform
- columnwise transform
- continuous Fourier transform
- coordinate system transform
- cosine transform
- C-transform
- CP-transform
- CPT-transform
- data transform
- direct electronic Fourier transform
- direct Fourier transform
- discrete cosine transform
- discrete Fourier transform
- discrete Hartley transform
- discrete Hilbert transform
- discrete Laplace transform
- F-transform
- fast Fourier transform
- fast Hartley transform
- fast polynomial transform
- fast Walsh transform
- Fermat transform
- Fourier transform
- fractal transform
- Fresnel transform
- Golay transform
- gradient transform
- H-transform
- Hadamard transform
- Hartley transform
- hexagonal discrete Fourier transform
- Hilbert transform
- homomorphic transform
- image transform
- indirect discrete cosine transform
- inverse transform
- inverse discrete Fourier transform
- inverse Fourier transform
- inverse Laplace transform
- joint transform
- Karhunen-Loève transform
- Laplace transform
- linear transform
- long-time Fourier transform
- Lorentz transform
- Mersenne transform
- mode transform
- multirate Z-transform
- near-to-far field transform
- nonlinear transform
- odd discrete Fourier transform
- odd-frequency Fourier transform
- odd-time Fourier transform
- odd-time odd-frequency discrete Fourier transform
- optical Fourier transform
- optical Fresnel transform
- P-transform
- Poisson transform
- polynomial transform
- Radon transform
- rowwise transform
- S-transform
- slant transform
- smoothed coherence transform
- Sommerfeld's transform
- T-transform
- Taylor-Cauchy transform
- two-dimensional Fourier transform
- two-dimensional Hartley transform
- twofold Fourier transform
- Walsh-Hadamard transform
- wavelet transform
- W/H transform
- Winograd discrete Fourier transform
- Z-transform -
7 FHT
1) Медицина: fetal heart tones2) Военный термин: Formal Hardware Testing, field handling trainer4) Сокращение: fully heat-treated -
8 FHT
1. fast Hankel transform - быстрое преобразование Ганкеля;2. fast Hartley transform - быстрое преобразование Хартли;3. feed water holding tank - сборная ёмкость для питательной воды -
9 FHT
сокр. [fast Hartley transform] быстрое преобразование Хартли -
10 FHT
сокр. от fast Hartley transformбыстрое преобразование Хартли -
11 FHT
сокр. от fast Hartley transformEnglish-Russian dictionary of telecommunications and their abbreviations > FHT
См. также в других словарях:
Hartley transform — In mathematics, the Hartley transform is an integral transform closely related to the Fourier transform, but which transforms real valued functions to real valued functions. It was proposed as an alternative to the Fourier transform by R. V. L.… … Wikipedia
Discrete Hartley transform — A discrete Hartley transform (DHT) is a Fourier related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT… … Wikipedia
Hartley-Transformation — Die Hartley Transformation, abgekürzt HT, ist in der Funktionalanalysis, einem Teilgebiet der Mathematik, eine lineare Integraltransformation mit Bezug zur Fourier Transformation und wie diese eine Frequenztransformation. Im Gegensatz zur… … Deutsch Wikipedia
Arithmetic complexity of the discrete Fourier transform — See Fast Fourier transform#Bounds on complexity and operation counts for a general summary of this issue.Bounds on the multiplicative complexity of FFTIn his PhD thesis in 1987 [1] , Michael Heidman focus on the arithmetic theory of complexity… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Ralph Hartley — Infobox Scientist name = Ralph Hartley caption = birth date = birth date|1888|11|30 birth place = Spruce, Nevada death date = death date and age|1970|5|1|1888|11|30 death place = New Jersey residence = United States nationality = American field … Wikipedia
Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Fast Fourier Transform — Transformée de Fourier rapide La transformée de Fourier rapide (sigle anglais : FFT ou Fast Fourier Transform) est un algorithme de calcul de la transformée de Fourier discrète (TFD). Sa complexité varie en avec le nombre de points n, alors… … Wikipédia en Français
List of transforms — This is a list of transforms in mathematics.Integral transforms*Abel transform *Fourier transform **Short time Fourier transform *Hankel transform *Hartley transform *Hilbert transform **Hilbert Schmidt integral operator *Laplace transform… … Wikipedia
List of Fourier-related transforms — This is a list of linear transformations of functions related to Fourier analysis. Such transformations map a function to a set of coefficients of basis functions, where the basis functions are sinusoidal and are therefore strongly localized in… … Wikipedia